A decision procedure for positive implication.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A goal programming procedure for ranking decision making units in DEA

This research proposes a methodology for ranking decision making units byusing a goal programming model.We suggest a two phases procedure. In phase1, by using some DEA problems for each pair of units, we construct a pairwisecomparison matrix. Then this matrix is utilized to rank the units via the goalprogramming model.

متن کامل

A Decision Procedure for Structured Cryptographic Protocols

Given a cryptographic protocol, it is possible to extract an inference system modelling exactly the set of messages an active intruder can learn by manipulating this protocol. Unfortunately, there is no general proof-search procedure to test whether or not a term belongs to the theory of an inference system. This paper presents the preliminary results obtained during an attempt to circumvent th...

متن کامل

A Decision Procedure for Rough Set Equalities

We use the notion of the rough set diagram introduced by Wasilewska and Vigneron 8] to present a general decision procedure for validity of equations in rough boolean algebra. First, we establish equivalence of validity in rough boolean algebra to validity in so called simple rough boolean algebra. Second, we propose a decision method for simple rough boolean algebra, which is to construct and ...

متن کامل

A Coalgebraic Decision Procedure for WS1S

Weak monadic second-order logic of one successor (WS1S) is a simple and natural formalism to specify regular properties. WS1S is decidable, although the decision procedure’s complexity is non-elementary. Typically, decision procedures for WS1S exploit the logic–automaton connection, i.e., they escape the simple and natural formalism by translating formulas into equally expressive regular struct...

متن کامل

A Decision Procedure for Geometry in Coq

We present in this paper the development of a decision procedure for affine plane geometry in the Coq proof assistant. Among the existing decision methods, we have chosen to implement one based on the area method developed by Chou, Gao and Zhang, which provides short and “readable” proofs for geometry theorems. The idea of the method is to express the goal to be proved using three geometric qua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1962

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093957237